package Graph;

public interface DirectedGraph<E> {
    public int getNumOfVertex();//获取顶点的个数
    boolean insertVex(E v);//插入顶点
    boolean deleteVex(E v);//删除顶点
    int indexOfVex(E v);//返回顶点的编号
    E getValueOfVex(int v);//编号为v的顶点的值
    boolean insertEdge(int start, int end,float weight);//插入边
    boolean deleteEdge(int start, int end);//删除边
    public float dijkstra(int v,int des);//查找源点到其它顶点的路径
}

